Star Edge Coloring of Some Classes of Graphs
نویسندگان
چکیده
منابع مشابه
List strong edge coloring of some classes of graphs
A strong edge coloring of a graph is a proper edge coloring in which every color class is an induced matching. The strong chromatic index of a graph is the minimum number of colors needed to obtain a strong edge coloring. In an analogous way, we can define the list version of strong edge coloring and list version of strong chromatic index. In this paper we prove that if G is a graph with maximu...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملEdge-Coloring and f-Coloring for Various Classes of Graphs
In an ordinary edge-coloring of a graph each color appears at each vertex at most once. An f -coloring is a generalized edge-coloring in which each color appears at each vertex v at most f(v) times where f(v) is a positive integer assigned to v. This paper gives efficient sequential and parallel algorithms to find ordinary edge-colorings and f -colorings for various classes of graphs such as bi...
متن کاملStar coloring of graphs
A star coloring of an undirected graph G is a proper vertex coloring of G (i.e., no two neighbors are assigned the same color) such that any path of length 3 in G is not bicolored. The star chromatic number of an undirected graph G, denoted by χs(G), is the smallest integer k for which G admits a star coloring with k colors. In this paper, we give the exact value of the star chromatic number of...
متن کاملEdge clique graphs and some classes of chordal graphs
The edge clique graph of a graph G is one having as vertices the edges of G, two vertices being adjacent if the corresponding edges of G belong to a common clique. We describe characterizations relative to edge clique graphs and some classes of chordal graphs, such as starlike, starlike-threshold, split and threshold graphs. In particular, a known necessary condition for a graph to be an edge c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2015
ISSN: 0364-9024
DOI: 10.1002/jgt.21862